Euler graph
英
美 [ˈɔɪlər ɡræf]
网络 欧拉图; 欧拉回路的图称为; Euler图
双语例句
- In this paper, Euler's formula and Handshaking lemma is used to obtain the face chromatic number of a planar graph by solving equations.
本文在前人研究的面着色问题基础上，运用欧拉公式和握手定理通过解方程组得到连通平面图的面色数。 - The Zarathustra Project and Reconstruction of Human Moral According to the judging theory of Euler entry ( or circuit) in undirected connected graph, the algorithm and program of computer solution are decided.
查拉图斯特拉工程与道德的本质&论欧洲基因技术与克隆道德根据无向连通图中欧拉通路或欧拉回路的判定定理，给出计算机求解的算法和程序。 - Based on the Activity Cycle Diagram, the Euler Nets method is developed by us under the guidance of Graph Theory and the Nets Theory.
这种方法是在图论和网论的指导下，在活动周期图建模方法基础上发展起来的。 - The Algorithm of Judging Euler Entry ( or Circuit) in Connected Graph
判定连通图中欧拉通路（或回路）的算法 - Euler solved this problem in 1736.He changed this problem into the first graph theory problem by abstract analyzed method.
欧拉在1736年解决了这个问题，他用抽象分析法将这个问题化为第一个图论问题。 - Euler Sub-Graph of A Quasi-Tree
一类拟树的Euler子图 - In this paper we give the exponential generating function for labeled Euler graphs having exactly n 2 connected Euler graphs and the k ( k ≥ 2) cut vertices distributed only on one 2 connected Euler graph.
在这里给出了含有n个2-连通Euler图和k（k≥2）个割点，并且所有割点均分布在其中一个2-连通Euler图的标号Euler图的指数型生成函数。 - This paper discusses the enumeration of labeled Euler graphs with k ( k ≥ 2) cut vertices distributed only on one 2 connected Euler graph.
本文讨论了具有k（k≥2）个割点，并且所有割点均分布在一个2-连通Euler图的标号Euler图的计数。 - The Problem of a Subdivision Graph of the Convex n-polygon Which Is Euler Graph
关于凸n边形的剖分图是欧拉图的问题 - The Euler Property of Line-Clique Graph
线团图的欧拉性质 - This thesis provides a Laconic Sufficiency Proof about Connected Graph of Euler Circuit, which is not clear on other scientific papers.
连通图Euler回路充分性的证明在一般文献上的表述并不直观，该文拟将给出一个较为直观简洁的证明。